A 5.1μJ per point-multiplication elliptic curve cryptographic processor

نویسندگان

  • Vladimir Rozic
  • Oscar Reparaz
  • Ingrid Verbauwhede
چکیده

Security features such as privacy and device authentication are required in wireless sensor networks, electronic IDs, RFID tags and many other applications. These features are provided using cryptography. Symmetric key cryptography, where the key is distributed between the communication parties prior to communication, doesn’t provide adequate solution for large scalable systems such as sensor networks. In these cases, public-key cryptography (PKC) should be used. However, public-key algorithms are typically more computationally intensive than their symmetric key counterparts, which creates difficulties in meeting the strict area, power and energy requirements. Elliptic curve cryptography (ECC), due to relatively small operand sizes, can be used to answer the imposed challenges. In this paper we present a processor for ECC over GF(2). This processor can perform elliptic curve (EC) point multiplication as well as general modular operations. The processor is flexible enough to support multiple cryptographic protocols. The chip is fabricated using UMC .13 μm 1P8M process, resulting in a core area of 0.54 mm. The energy consumption to perform one EC point multiplication is 5.1 μJ. The design features lightweight countermeasures against sidechannel attacks. A security evaluation shows the effectiveness of such countermeasures.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GF(2) Elliptic Curve Cryptographic Processor Architecture Based On Bit Level Pipelined Digit Serial Multiplication

New processor architecture for elliptic curve encryption is proposed in this paper. The architecture exploits projective coordinates to convert GF(2) division needed in elliptic point operations into several multiplication steps. The processor has three GF(2) multipliers implemented using bit-level pipelined digit serial computation. It is shown that this results in a faster operation than usin...

متن کامل

Hardware Implementation of Elliptic Curve Point Multiplication over GF (2) for ECC protocols

The Elliptic Curve Cryptography covers all relevant asymmetric cryptographic primitives like digital signatures and key agreement algorithms. In the present work, we develop a design of elliptic curve operations over binary Fields GF (2). The function used for this purpose is the scalar multiplication kP which is the core operation of ECCs. Where k is an integer and P is a point on an elliptic ...

متن کامل

High radix parallel architecture for GF(p) elliptic curve processor

A new GF(p) cryptographic processor architecture for elliptic curve encryption/decryption is proposed in this paper. The architecture takes advantage of projective coordinates to convert GF(p) inversion needed in elliptic point operations into several multiplication steps. Unlike existing sequential designs, we show that projecting into (X/Z,Y/Z) leads to a much better improved performance than...

متن کامل

Efficient Algorithm and Architecture for Elliptic Curve Cryptographic Processor

This paper presents a new high-efficient algorithm and architecture for an elliptic curve cryptographic processor. To reduce the computational complexity, novel modified Lopez-Dahab scalar point multiplication and left-to-right algorithms are proposed for point multiplication operation. Moreover, bit-serial Galois-field multiplication is used in order to decrease hardware complexity. The field ...

متن کامل

Classification and Comparison of Scalar Multiplication Algorithms in Elliptic Curve Cryptosystems

The most popular public-key cryptography systems nowadays are RSA and Elliptic Curve Cryptography (ECC). ECC is a type of public-key cryptosystem which uses the additive group of points on a nonsingular elliptic curve as a cryptographic medium. The basic operation in most elliptic curve cryptosystems is a scalar multiplication. Scalar Multiplication is the costliest operation among all in ECC w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • I. J. Circuit Theory and Applications

دوره 45  شماره 

صفحات  -

تاریخ انتشار 2017